On stability of the Hamiltonian index under contractions and closures

The hamiltonian index of a graph $G$ is the smallest integer $k$ such that the $k$-th iterated line graph of $G$ is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index. We use this result to prove that neither the contraction of an $A_G(F)$-contractible subgraph $F$ of a graph $G$ nor the closure operation performed on $G$ (if $G$ is claw-free) affects the value of the hamiltonian index of a graph $G$

How many conjectures can you stand: a survey

We survey results and open problems in hamiltonian graph theory centered around two conjectures of the 1980s that are still open: every 4-connected claw-free graph (line graph) is hamiltonian. These conjectures have lead to a wealth of interesting concepts, techniques, results and equivalent conjectures

On the parameterized complexity of edge-linked paths

by Neeldhara Misra, Fahad Panolan and Saket Saurab